Disintegration, Yule Process and Random Graphs
نویسنده
چکیده
In this paper we demonstrate that the disintegration process of radioactive atoms in the discrete time model has a natural interpretation in the theory of random graphs. Moreover, we reduce some problems in this area to disintegration processes with anomalies. For instance , we derive exact closed formull for the probabilities and the moments of the number of isolated vertices in Bernoulli graphs and we investigate the connectedness of a graph. With a similar approach we study a diierent problem, namely the Yule process, and we observe some relationships to the theory of fractals.
منابع مشابه
Disintegration Processes and Connectivity in Random Graphs
The subject of this paper are Markov chains arising from the study of random graphs. The processes into consideration are interpreted as a discrete-time disintegration of radioactive atoms with anomalies. Our approach is based on (multivariate) generating functions which allow both exact analyses and asymptotic estimates. In particular, we investigate a traversing algorithm on random graphs and...
متن کاملLarge Deviations for the Leaves in Some Random Trees
Large deviation principles and related results are given for a class of Markov chains associated to the “leaves” in random recursive trees and preferential attachment random graphs, as well as the “cherries” in Yule trees. In particular, the method of proof, combining analytic and Dupuis-Ellis type path arguments, allows for an explicit computation of the large deviation pressure.
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملTopology and inference for multi-type Yule trees
We introduce two models for multi-type random trees motivated by studies of trait dependence in the evolution of species. Our discrete time model, the multi-type ERM tree, is a generalization of Markov propagation models on a random tree generated by a binary search or ‘equal rates Markov’ mechanism. Our continuous time model, the multi-type Yule tree with mutations, is a multi-type generalizat...
متن کاملThe structure and distances in Yule recursive trees
Based on uniform recursive trees, we introduce random trees with the factor of time, which are named Yule recursive trees. The structure and the distance between the vertices in Yule recursive trees are investigated in this paper. For arbitrary time t > 0, we first give the probability that a Yule recursive tree Yt is isomorphic to a given rooted tree γ ; and then prove that the asymptotic dist...
متن کامل